Description: DTW（Dynamic Time Warping，动态时间归整）算法，该算法基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题，是语音识别中出现较早、较为经典的一种算法。用于孤立词识别，DTW算法与HMM算法在训练阶段需要提供大量的语音数据，通过反复计算才能得到模型参数，而DTW算法的训练中几乎不需要额外的计算。所以在孤立词语音识别中，DTW算法仍然得到广泛的应用。 -DTW (Dynamic Time Warping, dynamic time warping) algorithm based on dynamic programming (DP) ideas, sounds of varying lengths to solve the template matching problem, is speech recognition appeared earlier, more classic kind of algorithm. For isolated word recognition, DTW algorithm and HMM algorithm in the training phase need to provide a large number of voice data, obtained by repeated calculations to model parameters, while the DTW algorithm is almost no additional training calculations. Therefore, in isolated word speech recognition, DTW algorithm is still widely used. Platform: |
Size: 6144 |
Author:fujuan |
Hits:
Description: 在双目立体视觉中立体匹配问题存在歧义性，是视觉研究中难点问题之。通过采用分水岭分割图像的方式有效的对图像进行了过分割处理，实现了基于图像块置信传播的匹配算法。-In the binocular stereo vision problem in stereo matching ambiguity, is the difficult problems in vision research. Images by using watershed segmentation method was effective over-segmentation of the image processing, and belief propagation based on image block matching algorithm. Platform: |
Size: 282624 |
Author:mstar |
Hits:
Description: KM算法，很好的用于求二分图的最优匹配问题-KM algorithm, very good for seeking the optimal bipartite graph matching problem Platform: |
Size: 1024 |
Author:张久 |
Hits:
Description: 假设在周末舞会上，男士和女士进入舞厅时，各自排成一队。跳舞开始时，依次从男队和女队的队头上各出一人配成舞伴。若两队初始人数不相同，则较长的那一队中未配对者等待下一轮舞曲。现要求写一算法模拟上述舞伴配对问题。
输入、输出方法自行设计，要易于操作、不易死机。
-Assuming the ball at the weekend, men and women into the ballroom, the respective queue. Dance begins, followed by men' s and women' s teams from the teams head out of one of the paired partners. If the initial number of teams is not the same, no longer in that team were waiting for the next round of the dance pairs. Are asked to write an algorithm simulating the partner matching problem. Input and output methods to design, to be easy to operate, easy to crash. Platform: |
Size: 41984 |
Author:tamakiramimy |
Hits:
Description: 假设在周末舞会上，男士和女士进入舞厅时，各自排成一队。跳舞开始时，依次从男队和女队的队头上各出一人配成舞伴。若两队初始人数不相同，则较长的那一队中未配对者等待下一轮舞曲。现要求写一算法模拟上述舞伴配对问题。
输入、输出方法自行设计，要易于操作、不易死机。
-Assuming the ball at the weekend, men and women into the ballroom, the respective queue. Dance begins, followed by men' s and women' s teams from the teams head out of one of the paired partners. If the initial number of teams is not the same, no longer in that team were waiting for the next round of the dance pairs. Are asked to write an algorithm simulating the partner matching problem. Input and output methods to design, to be easy to operate, easy to crash. Platform: |
Size: 37888 |
Author:tamakiramimy |
Hits:
Description: 摘 要：基于块的运动估计是视频压缩国际标准中广泛采用的关键技术。在对目前运动估计快速块匹配算法研究的基础上，描述了运动估计
的原理；揭示 了在图像质量、搜索速度和压缩码率等方面提高算法效率时存在的3 类主要问题 ：初始搜索点的选择、匹配准则和搜索策略 ；
分另 q 阐述了目前常用的解决这3 类问题的方法，并进行了比较和分析 ；提出了对运动估计算法的一些展望。-Abstract: The block-based motion estimation is a video compression standard is widely used in international key technology. In the current fast block matching motion estimation algorithm based on the principles described in the motion estimation revealed in image quality, the search speed and compression rate and so improve the efficiency exists in the 3 principal issues: the initial search point selection, matching criteria and search strategies points q describes the other currently used to solve the 3 class problem, and compared and analyzed proposed motion estimation algorithm on some prospects. Platform: |
Size: 182272 |
Author:zjl |
Hits:
Description: This source code solves the matching problem in bipartite graphs by implementing the Hungarian Algorithm. Platform: |
Size: 117760 |
Author:Omid |
Hits:
Description: 用C++语言编写的运动员最佳匹配问题的回溯法实现-Written in C++, the best athletes to achieve matching problem backtracking Platform: |
Size: 1024 |
Author:zhangxiao |
Hits:
Description: DTW（Dynamic Time Warping，动态时间归整）算法，该算法基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题-A Dynamic Warping, DTW (Dynamic Time GuiZheng) algorithm, which is based on Dynamic programming (DP) ideas, solving the pronunciation different length of template matching problem
Platform: |
Size: 2048 |
Author:jieli |
Hits:
Description: 高独特性特征的选择以及合适匹配策略的选用是人脸识别技术的关键。讨论了基于仿射不变的几何特
征SIFT算子进行人脸识别的方法。SIFT算子的计算复杂度较高，并且不同的人脸表情和图像模糊会加大特征匹
配的难度。为克服上述缺点，提出了一种新的算法，将选择6个人脸上感兴趣子区域进行描述，并根据各自的独特
性赋予不同的权值，最后在匹配过程中使用相似度的平方来减小偏差数据造成的影响。实验结果表明，该方法能
有效减轻表情变化对于身份识别率急剧下降的影响，并可显著减少计算复杂度和特征匹配时间。-Choosing a distinctive feature and matching criterion is key to developing a reliable face recognition system．
This paper discusses the availability of one of geometric feature invariants，scale invariant feature transform (SIFT)
descriptor based face recognition． The SIFT feature description of an image is typically complex． In most cases， the
difficulty of feature matching problem is aggravated when the diferent face expressions and image blur exist． For
abovementioned issues，in this paper we proposes a new method that six interest sub—regions from the face are selected to be
described and later be calculated through diferent weights according to their distinctiveness．The square of the similarity is
used to solve the problem of data deviation．The experimental results demonstrate that our method does effectively moderate
the face expression efect． It also successfully reduces the complexity and matching time of SIFT feature sets． Platform: |
Size: 286720 |
Author:陈方芳 |
Hits:
Description: 括号匹配问题，输入字符，有3种括号（）{}[]，括号不能交叉，可以嵌套，且（）中不能有[]，和{}，[]中不能有{}-Parenthesis matching problem, the input characters, there are three brackets (){}[], brackets can not cross, can be nested, and () can not have [], and {},[] can not have {} Platform: |
Size: 2048 |
Author:苏路 |
Hits:
Description: 匈牙利算法 求解最大匹配问题 s为最佳匹配的总权值
e(:,[1,2])为匹配的两点，e(:,3)为各匹配的权-Hungarian algorithm to solve the maximum matching problem s is the best match of the total weight e (:, [1,2]) to match the two points, e (:, 3) for the right match Platform: |
Size: 2048 |
Author:when |
Hits:
Description: 如何在一个字符串中，寻找相同的子串即就是字符串的匹配问题-How, in a string, substring search for the same string matching problem that is Platform: |
Size: 1024 |
Author:拈龙刺穹 |
Hits:
Description: 串匹配问题。在主串中找出与模式串匹配的字符开始位置即下标。-String matching problem. In the main string and pattern matching to find the character position that subscript. Platform: |
Size: 336896 |
Author:韩娇 |
Hits:
Description: SIFT的技术文档，SIFT特征匹配算法是目前国内外特征点匹配研究领域的热点与难点，其匹配能力较强，可以处理两幅图像之间发生平移、旋转、仿射变换情况下的匹配问题，甚至在某种程度上对任意角度拍摄的图像也具备较为稳定的特征匹配能力-SIFT feature matching algorithm is matching feature points at home and abroad in the research field of the hot issues and difficulties, and the matching with the strong ability to deal with two images happened between translation, rotation, affine transformation of matching problem, even in some degree of arbitrary Angle shot of the image and also has a relatively stable feature matching ability
Platform: |
Size: 1642496 |
Author:xxx |
Hits:
Description: SIFT特征匹配算法是目前国内外特征点匹配研究领域的热点与难点，其匹配能力较强，可以处理两幅图像之间发生平移、旋转、仿射变换情况下的匹配问题，甚至在某种程度上对任意角度拍摄的图像也具备较为稳定的特征匹配能力。-SIFT feature matching algorithm is matching feature points at home and abroad in the research field of the hot issues and difficulties, and the matching with the strong ability to deal with two images happened between translation, rotation, affine transformation of matching problem, even in some degree of arbitrary Angle shot of the image and also has a relatively stable feature matching ability.
Platform: |
Size: 8180736 |
Author:xxx |
Hits:
Search - matching problem